Approximate Searching for Music Data in Real-Valued Feature Indexing

نویسندگان

  • Yu-Lung Lo
  • Ling-Yi Tsai
چکیده

For the music database retrieval, the researchers extract the features, such as melodies, rhythms and chords, from the music data and develop indices to support the quick music search. Several reports have pointed out that these features can be transformed and represented in the forms of music feature strings or numeric values such that string indexing or numeric indexing is created, respectively, for music retrieval. Recently, A real-valued feature indexing technique has been proposed for music data retrieval. This approach has demonstrated that it can support music searching more efficiently than existing schemes. However, there is only exactly matching for music retrieval discussed. The approximate searching for music database has not received many attentions yet. In this paper, we will propose an approximate searching scheme for music data retrieval in a real-valued feature index. The experimental results show that our approach outperforms existing scheme for music approximate searching.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Music Representation, Indexing and Retrieval at NTHU

In this extended abstract, our work on the representation, indexing and retrieval of music data is summarized. We treat the rhythm, melody, and chords of a music object as music features and develop various data structures and algorithms to efficiently perform approximate and partial matching for the retrieval of music data [Liu99a], [Chen98], [Chou96]. In [Chen00a], we present the techniques f...

متن کامل

Indexing without Invariants in 3D Object Recognition

ÐWe present a method of indexing three-dimensional objects from single two-dimensional images. Unlike most other methods to solve this problem, ours does not rely on invariant features. This allows a richer set of shape information to be used in the recognition process. We also suggest the kd-tree as an alternative indexing data structure to the standard hash table. This makes hypothesis recove...

متن کامل

A Generic System for audio indexing: application to speech/music segmentation and music genre recognition

In this paper we present a generic system for audio indexing (classification/ segmentation) and apply it to two usual problems: speech/ music segmentation and music genre recognition. We first present some requirements for the design of a generic system. The training part of it is based on a succession of four steps: feature extraction, feature selection, feature space transform and statistical...

متن کامل

Efficient Similarity Indexing and Searching in High Dimensions

Efficient indexing and searching of high dimensional data has been an area of active research due to the growing exploitation of high dimensional data and the vulnerability of traditional search methods to the " curse of dimensionality ". This paper presents a new approach for fast and effective searching and indexing of high dimensional features using random partitions of the feature space. Ex...

متن کامل

Indexing Methods for Approximate String Matching

Indexing for approximate text searching is a novel problem receiving much attention because of its applications in signal processing, computational biology and text retrieval, to name a few. We classify most indexing methods in a taxonomy that helps understand their essential features. We show that the existing methods, rather than completely diierent as they are regarded, form a range of solut...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JCIT

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2009